Formalization and Verification of Hierarchical Use of Interaction Overview Diagrams Using Timing Diagrams

Thanks to its graphical notation and simplicity, Unified Modeling Language (UML) is a de facto standard and a widespread language used in both industry and academia, despite the fact that its semantics is still informal. The Interaction Overview Diagram (IOD) is introduced in UML2; it allows the specification of the behavior in the hierarchical way. This paper is a contribution towards a formal dynamic semantics of UML2. We start by formalizing the Hierarchical use of IOD. Afterward, we complete the mapping of IOD, Sequence Diagrams and Timing Diagrams into Hierarchical Colored Petri Nets (HCPNs) using the Timed colored Petri Nets (timed CP-net). Our approach helps designers to get benefits from abstraction as well as refinement at more than two levels of hierarchy which reduces verification complexity.Comment: 8 pages, 6 figure

mAPN: Modeling, Analysis, and Exploration of Algorithmic and Parallelism Adaptivity

Using parallel embedded systems these days is increasing. They are getting more complex due to integrating multiple functionalities in one application or running numerous ones concurrently. This concerns a wide range of applications, including streaming applications, commonly used in embedded systems. These applications must implement adaptable and reliable algorithms to deliver the required performance under varying circumstances (e.g., running applications on the platform, input data, platform variety, etc.). Given the complexity of streaming applications, target systems, and adaptivity requirements, designing such systems with traditional programming models is daunting. This is why model-based strategies with an appropriate Model of Computation (MoC) have long been studied for embedded system design. This work provides algorithmic adaptivity on top of parallelism for dynamic dataflow to express larger sets of variants. We present a multi-Alternative Process Network (mAPN), a high-level abstract representation in which several variants of the same application coexist in the same graph expressing different implementations. We introduce mAPN properties and its formalism to describe various local implementation alternatives. Furthermore, mAPNs are enriched with metadata to Provide the alternatives with quantitative annotations in terms of a specific metric. To help the user analyze the rich space of variants, we propose a methodology to extract feasible variants under user and hardware constraints. At the core of the methodology is an algorithm for computing global metrics of an execution of different alternatives from a compact mAPN specification. We validate our approach by exploring several possible variants created for the Automatic Subtitling Application (ASA) on two hardware platforms.Comment: 26 PAGES JOURNAL PAPE

On the use of Rewriting Logic for Verification of Distributed Software Architecture Description Based LFP

Software architecture description languages (ADLs) allow software designers to focus on high level aspects of an application by abstracting from the details of the components that compose architecture. It is precisely this abstraction that makes ADLs suitable for verification using model checking techniques. ADLs are, in a way, domain-specific languages for aspects such as coordination and distribution. LfP (language for prototyping) is a formal approach for distributed software architectures that is based on RM-ODP and that can be linked to an UML methodology. We propose in this paper a rewriting of the LfP semantics, specified in rewriting logic which is well suited for axiomatization of concurrent languages. Using the Maude system, a high-performance interpreter based on rewriting logic, we illustrate through an example how this rewriting semantics can be exploited for verification aspects related to distributed object interactions.For further information, please visit this web site

On CPN-based Verification of Hierarchical Formalization of UML2 Interaction Overview Diagrams

Verification of Hierarchical Formalization of IOD Diagram

AI Approaches for IoT Security Analysis

IoT networks are increasingly used as entry points for cyberattacks, as often they offer low-security levels, as they may allow the control of physical systems and as they potentially also open the access to other IT networks and infrastructures. Existing intrusion detection systems (IDS) and intrusion prevention systems (IPS) mostly concentrate on legacy IT networks. Nowadays, they come with a high degree of complexity and adaptivity, including the use of artificial intelligence. It is only recently that these techniques are also applied to IoT networks. In this paper, we present a survey of machine learning and deep learning methods for intrusion detection, and we investigate how previous works used federated learning for IoT cybersecurity. For this, we present an overview of IoT protocols and potential security risks. We also report the techniques and the datasets used in the studied works, discuss the challenges of using ML, DL and FL for IoT cybersecurity and provide future insights

Nouvelle Approche pour la Définition et la Manipulation de la Négation par les Programmes Stratifiés

International audienceLa négation est utile dans la majorité des applications du monde réel. Cependant son introduction entraîne des problèmes sémantiques et canoniques. Dans cet article, nous proposons une approche basée sur la stratification pour traiter les problèmes de négation. Cette approche se base sur une extension des réseaux de prédicats. Elle se caractérise par deux contributions principales. La première concerne la gestion de toute la classe des programmes stratifiés. La deuxième contribution est liée aux opérations habituelles d'optimisations des programmes stratifiés (stratification maximale, mises à jour par accroissement, etc.).Negation is useful in the majority of the real worldapplications. However, its introduction leads to semantic andcanonical problems. We propose in this paper an approach based onstratification to deal with negation problems. This approach is basedon an extension of predicates nets. It is characterized with two maincontributions. The first concerns the management of the whole classof stratified programs. The second contribution is related to usualoperations of optimizations on stratified programs (maximalstratification, incremental updates, etc.)